New results on the k-Truck ProblemWEIMIN MA; YINFENG XU; YOU, Jane et al.Lecture notes in computer science. 2002, pp 504-513, issn 0302-9743, isbn 3-540-43996-X, 10 p.Conference Paper

Optimal on-line algorithms to minimize makespan on two machines with resource augmentationEPSTEIN, Leah; GANOT, Arik.Lecture notes in computer science. 2004, pp 109-122, issn 0302-9743, isbn 3-540-21079-2, 14 p.Conference Paper

Analyses on the generalised lotto-type competitive learningLUK, Andrew.Lecture notes in computer science. 2000, pp 9-16, issn 0302-9743, isbn 3-540-41450-9Conference Paper

Improved randomized on-line algorithms for the list update problemALBERS, S.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 682-693, issn 0097-5397Article

Uniform multipaging reduces to pagingLIBERATORE, V.Information processing letters. 1998, Vol 67, Num 1, pp 9-12, issn 0020-0190Article

Speed scaling for stretch plus energyCOLE, Daniel; IM, Sungjin; MOSELEY, Benjamin et al.Operations research letters. 2012, Vol 40, Num 3, pp 180-184, issn 0167-6377, 5 p.Article

On-line grid-packing with a single active gridFUJITA, Satoshi.Lecture notes in computer science. 2002, pp 476-483, issn 0302-9743, isbn 3-540-43996-X, 8 p.Conference Paper

Competitive learning methods for efficient vector quantizations in a speech recognition environmentCURATELLI, F; MAYORA-IBARRA, O.Lecture notes in computer science. 2000, pp 108-114, issn 0302-9743, isbn 3-540-67354-7Conference Paper

On the competitiveness of the move-to-front ruleMARTINEZ, C; ROURA, S.Theoretical computer science. 2000, Vol 242, Num 1-2, pp 313-325, issn 0304-3975Article

Carrying umbrellas : An online relocation problem on graphsLEE, J.-H; PARK, C.-D; CHWA, K.-Y et al.Lecture notes in computer science. 1999, pp 195-204, issn 0302-9743, isbn 3-540-66916-7Conference Paper

A message authentication code based on unimodular matrix groupsCARY, Matthew; VENKATESAN, Ramarathnam.Lecture notes in computer science. 2003, pp 500-512, issn 0302-9743, isbn 3-540-40674-3, 13 p.Conference Paper

Scheduling broadcasts with deadlinesKIM, Jae-Hoon; CHWA, Kyung-Yong.Lecture notes in computer science. 2003, pp 415-424, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Preemptive scheduling in overloaded systemsCHROBAK, Marek; EPSTEIN, Leah; NOGA, John et al.Lecture notes in computer science. 2002, pp 800-811, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

BDD-based decision procedures for κGUOQIANG PAN; SATTLER, Ulrike; VARDI, Moshe Y et al.Lecture notes in computer science. 2002, pp 16-30, issn 0302-9743, isbn 3-540-43931-5, 15 p.Conference Paper

Towards fewer parameters for SAT clause weighting algorithmsTHORNTON, John; PULLAN, Wayne; TERRY, Justin et al.Lecture notes in computer science. 2002, pp 569-578, issn 0302-9743, isbn 3-540-00197-2, 10 p.Conference Paper

Corrigendum: A Hybrid Approach Based on the Combination of Adaptive Neuro-Fuzzy Inference System and Imperialist Competitive Algorithm: Oil Flow Rate of the Wells Prediction Case Study, International Journal of Computational Intelligence Systems, 6 (2), 2013, p. 198-208SHAHRAM MOLLAIY-BERNETI.International journal of computational intelligence systems. 2013, Vol 6, Num 1-6, p. 595Article

Exploring an unknown graph efficientlyFLEISCHER, Rudolf; TRIPPEN, Gerhard.Lecture notes in computer science. 2005, pp 11-22, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

On-line scheduling on a single machine : minimizing the total completion timeFIAT, A; WOEGINGER, G. J.Acta informatica. 1999, Vol 36, Num 4, pp 287-293, issn 0001-5903Article

Minimizing the maximum starting time on-lineEPSTEIN, Leah; VAN STEE, Rob.Lecture notes in computer science. 2002, pp 449-460, issn 0302-9743, isbn 3-540-44180-8, 12 p.Conference Paper

A note on semi-online machine coveringEBENLENDR, Tomas; NOGA, John; SGALL, Jiri et al.Lecture notes in computer science. 2006, pp 110-118, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 9 p.Conference Paper

Push-relabel based algorithms for the maximum transversal problemKAYA, Kamer; LANGGUTH, Johannes; MANNE, Fredrik et al.Computers & operations research. 2013, Vol 40, Num 5, pp 1266-1275, issn 0305-0548, 10 p.Article

Using Evolutionary Imperialist Competitive Algorithm (ICA) to Coordinate Overcurrent RelaysRAZAVI, Farzad; KHORANI, Vahid; GHONCHEH, Ahsan et al.Genetic and evolutionary methods. International conferenceWorldComp'2011. 2011, pp 15-20, isbn 1-60132-182-1, 6 p.Conference Paper

On-line extensible bin packing with unequal bin sizesDESHI YE; GUOCHUAN ZHANG.Lecture notes in computer science. 2004, pp 235-247, issn 0302-9743, isbn 3-540-21079-2, 13 p.Conference Paper

Combining forces to solve the car sequencing problemPERRON, Laurent; SHAW, Paul.Lecture notes in computer science. 2004, pp 225-239, issn 0302-9743, isbn 3-540-21836-X, 15 p.Conference Paper

Non-clairvoyant scheduling for minimizing mean slowdownBANSAL, N; DHAMDHERE, K; KÖNEMANN, J et al.Lecture notes in computer science. 2003, pp 260-270, issn 0302-9743, isbn 3-540-00623-0, 11 p.Conference Paper